On Logics and Semantics for Interpretability
نویسندگان
چکیده
Abstract We study various properties of formalised relativised interpretability. In the central part this thesis we for different interpretability logics following aspects: completeness modal semantics, decidability and algorithmic complexity. particular, two basic types relational semantics logics. One is Veltman which shall refer to as regular or ordinary semantics; other called generalised semantics. recent years especially during writing thesis, was shown be particularly well-suited a results are easier obtain in some cases; can proven via filtration all known cases. prove new reprove old with respect use method finite model property Apart from concerning its own right, also apply methods determine (implied by property) complexity provability (and consistency) problems certain From arithmetical standpoint, explore three series principles. For them, soundness already known, give proof soundness. The third our considerations. it arithmetically sound characterise frame conditions w.r.t. prepared Luka Mikec. E-mail : [email protected] URL http://hdl.handle.net/2445/177373
منابع مشابه
Modal Matters for Interpretability Logics
This paper is the first in a series of three related papers on modal methods in interpretability logics and applications. In this first paper the fundaments are laid for later results. These fundaments consist of a thorough treatment of a construction method to obtain modal models. This construction method is used to reprove some known results in the area of interpretability like the modal comp...
متن کاملModal Matters in Interpretability Logics
In this paper we expose a method for building models for interpretability logics. The method can be compared to the method of taking unions of chains in classical model theory. Many applications of the method share a common part. We isolate this common part in a main lemma. Doing so, many of our results become applications of this main lemma. We also briefly describe how our method can be gener...
متن کاملProvability and Interpretability Logics with Restricted Realizations
The provability logic of a theory T is the set of modal formulas, which under any arithmetical realization are provable in T . We slightly modify this notion by requiring the arithmetical realizations to come from a specified set Γ. We make an analogous modification for interpretability logics. We first studied provability logics with restricted realizations, and show that for various natural c...
متن کاملOn Fibring Semantics for BDI Logics
This study examines BDI logics in the context of Gabbay’s fibring semantics. We show that dovetailing (a special form of fibring) can be adopted as a semantic methodology to combine BDI logics. We develop a set of interaction axioms that can capture static as well as dynamic aspects of the mental states in BDI systems, using Catach’s incestual schema Ga,b,c,d . Further we exemplify the constrai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Bulletin of Symbolic Logic
سال: 2022
ISSN: ['1943-5894', '1079-8986']
DOI: https://doi.org/10.1017/bsl.2022.3